CTL+ Is Complete for Double Exponential Time
نویسندگان
چکیده
We show that the satisfiability problem for CTL, the branching time logic that allows boolean combinations of path formulas inside a path quantifier but no nesting of them, is 2-EXPTIME-hard. The construction is inspired by Vardi and Stockmeyer’s 2-EXPTIME-hardness proof of CTL∗’s satisfiability problem. As a consequence, there is no subexponential reduction from CTL to CTL which preserves satisfiability.
منابع مشابه
Supervisory Control of Discrete Event Systems with CTL* Temporal Logic Specifications
The supervisory control problem of discrete event systems with temporal logic specifications is studied. The full branching time logic of CTL* is used for expressing specifications of discrete event systems. The control problem of CTL* is reduced to the decision problem of CTL*. A small model theorem for the control of CTL* is obtained. It is shown that the control problem of CTL* (resp., CTL) ...
متن کاملA Proof System for CTL ∗ μ
The logic CTLμ extends the full branching time logic CTL ∗ with arbitrary least and greatest fixed point operators on sets of paths. This gives it at least the power to express all ω-regular languages on paths. We also consider a syntactical fragment of CTLμ restricting the legal range of fixed point operators that is still as expressive as ECTL∗. First, we present a tableaux-style proof system...
متن کاملOn the Hybrid Extension of CTL and CTL+
The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that HCTL and HCTL, the hybrid extensions with one variable of CTL and CTL, respectively, are expressively equivale...
متن کاملThe Complexity of Tree Automata and Logics of Programs (Extended Abstract)
The complexity of testing nonemptiness of finite state automata on infinite trees is investigated. It is shown that for tree automata with the pairs (or complemented pairs) acceptance condition having m states and n pairs, nonemptiness can be tested in deterministic time (mn)O(n); however, it is shown that the problem is in general NP-complete (or co-NP-complete, respectively). The new nonempti...
متن کاملSATISFIABILITY GAMES FOR BRANCHING - TIME LOGICS 3 Other approaches
The satisfiability problem for branching-time temporal logics like CTL∗, CTL and CTL has important applications in program specification and verification. Their computational complexities are known: CTL∗ and CTL are complete for doubly exponential time, CTL is complete for single exponential time. Some decision procedures for these logics are known; they use tree automata, tableaux or axiom sys...
متن کامل